Ready Queue Mean Time Estimation in Lottery Scheduling using Auxiliary Variables in Multiprocessor Environment

نویسندگان

  • D. Shukla
  • Anjali Jain
  • Carl A. Waldspurger
  • William E. Weihl
  • David Petrou
  • Garth A. Gibson
  • John W. Milford
چکیده

The ready queue estimation problem appears when many processes remain in the ready queue after the sudden failure. The system manager has to decide immediately how much further time is required to process all the remaining jobs in the ready queue. In lottery scheduling, this prediction is possible with the help of sampling techniques. To strengthen the prediction methodology, the auxiliary source of data is often utilized. This paper considers the three additional data sources as (i) process size (ii) process priority and (iii) process expected time. The Ratio method, existing in sampling literature, is used to predict the time required for remaining jobs after failure. A comparative study between different auxiliary sources has been made. It is found that highly correlated source of auxiliary information provides better processing time prediction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Ready Queue Processing Time using Transformed Factor-Type (T-F-T) Estimator in Multiprocessor Environment

The ready queue processing time estimation problem appears when many processes remain in the ready queue just before the occurrence of sudden failure of system. The system administrator has to decide immediately, how much further time is required to process the remaining jobs in the ready queue, before shutting down the entire system as precautionary measure, so that while restart, it may remai...

متن کامل

Estimation of Ready Queue Processing Time using Efficient Factor Type Estimator (E-F-T) in Multiprocessor Environment

The ready queue processing time estimation problem appears when many processes remain in the ready queue after the sudden failure. The system manager has to decide immediately how much further time is required to process remaining jobs in the ready queue. In lottery scheduling, this prediction is possible with the help of sampling techniques. Ratio method, existing in literature of sampling, wa...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

Estimation of Quantum Time Length for Round-robin Scheduling Algorithm using Neural Networks

The quantum time length is usually taken as a fixed value in all applications that use Round Robin (RR) scheduling algorithm. The determination of the optimal length of the quantum that results in a small average turn around time is very complicated because of the unknown nature of the tasks in the ready queue. The round robin algorithm becomes very similar to the first in first served algorith...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012